Correlated Equilibria and Probabilistic Inference in Graphical Models

نویسنده

  • Luis E. Ortiz
چکیده

This paper explores the connection between belief inference and game-theoretic equilibria within the context of graphical models. While a lot of the work in graphical models for game theory has mirrored that in probabilistic graphical models, the paper also considers the opposite direction: Taking advantage of recent advances in equilibrium computation for probabilistic inference. In particular, the paper presents formulations of inference problems in Markov random fields as computation of equilibria in a certain class of game-theoretic graphical models. To do so, the paper introduces graphical multihypermatrix games (GMGs), a new class of graphical models for game theory that generalize graphical and polymatrix games. It also introduces graphical versions of potential games, which play a key role in the formulations, and presents results derived from the study of their properties. Finally, the paper includes a study of correlated equilibria in GMGs and provides both a characterization of the equilibria in such games and the design of a simple linear feasibility system for computing the equilibria based on the extension of a standard approach within the probabilistic and constraint graphical models community.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rule-based joint fuzzy and probabilistic networks

One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...

متن کامل

An Empirical Evaluation of Algorithms for Computing Equilibria in Games for Approximate Inference in Large Dimensional Probabilistic Graphical Models

Work in graphical models for game theory typically borrows from results in probabilistic graphical models. In this work, we instead consider the opposite direction. By using recent advances in equilibrium computation, we propose game-theoretic inspired, practical methods to perform probabilistic inference. We perform synthetic experiments using several different classes of Ising models, in orde...

متن کامل

Efficient Query Evaluation over Temporally Correlated Probabilistic Streams

Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. Query processing over such streaming data must be cognizant of these correlations, since they significantly alter the final query results. Several prior works have suggested approaches to handling correlations in proba...

متن کامل

Nash Propagation for Loopy Graphical Games

We introduce NashProp, an iterative and local message-passing algorithm for computing Nash equilibria in multi-player games represented by arbitrary undirected graphs. We provide a formal analysis and experimental evidence demonstrating that NashProp performs well on large graphical games with many loops, often converging in just a dozen iterations on graphs with hundreds of nodes. NashProp gen...

متن کامل

Likelihood-based inference for probabilistic graphical models: Some preliminary results

A method for calculating some profile likelihood inferences in probabilistic graphical models is presented and applied to the problem of classification. It can also be interpreted as a method for obtaining inferences from hierarchical networks, a kind of imprecise probabilistic graphical models.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009